ar X iv : 0 90 9 . 32 86 v 1 [ m at h . C O ] 1 7 Se p 20 09 O - cycles , vertex - oriented graphs , and the four colour theorem

نویسندگان

  • Ortho Flint
  • Stuart Rankin
چکیده

In 1880, P. G. Tait showed that the four colour theorem is equivalent to the assertion that every 3-regular planar graph without cut-edges is 3-edge-colourable, and in 1891, J. Petersen proved that every 3-regular graph with at most two cut-edges has a 1-factor. In this paper, we introduce the notion of collapsing all edges of a 1-factor of a 3-regular planar graph, thereby obtaining what we call a vertex-oriented 4-regular planar graph. We also introduce the notion of o-colouring a vertex-oriented 4-regular planar graph, and we prove that the four colour theorem is equivalent to the assertion that every vertex-oriented 4-regular planar graph without nontransversally oriented cut-vertex (VOGWOC in short) is 3-o-colourable. This work proposes an alternative avenue of investigation in the search to find a more conceptual proof of the four colour theorem, and we are able to prove that every VOGWOC is o-colourable (although we have not yet been able to prove 3-o-colourability).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating labeled graphs with a k-cycle

Cayley’s Tree Formula for enumerating labeled trees is well known. In this paper a more general result is presented for graphs with exactly one k-cycle (i.e. cycle on k vertices ).It is proved that for all integers n and k such that (n ≥ k ≥ 3), the number of possible labeled graphs on n vertices that contain exactly one k-cycle is ( n−1 k−1 ) nn−k. 1 ar X iv :0 90 9. 24 00 v1 [ m at h. C O ] 1...

متن کامل

ar X iv : 0 90 6 . 18 57 v 1 [ m at h . C O ] 1 0 Ju n 20 09 On the circumference , connectivity and dominating cycles

Every 4-connected graph with minimum degree δ and connectivity κ either has a cycle of length at least 4δ − 2κ or has a dominating cycle.

متن کامل

ar X iv : m at h - ph / 0 40 90 62 v 1 2 3 Se p 20 04 A remark on rational isochronous potentials

We consider the rational potentials of the one-dimensional mechanical systems, which have a family of periodic solutions with the same period (isochronous potentials). We prove that up to a shift and adding a constant all such potentials have the form U (x) = ω 2 x 2 or U (x) = 1 4 ω 2 x 2 + c 2 x −2 .

متن کامل

ar X iv : 0 90 9 . 19 31 v 1 [ m at h . C O ] 1 0 Se p 20 09 BUCHSBAUM * COMPLEXES

We introduce a class of simplicial complexes which we call Buchsbaum* over a field. Buchsbaum* complexes generalize triangulations of orientable homology manifolds. By definition, the Buchsbaum* property depends only on the geometric realization and the field. Characterizations in terms of simplicial and local cohomology are given. It is shown that Buchsbaum* complexes are doubly Buchsbaum. App...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009